An Oxford Survey of Order Sorted Algebra
نویسندگان
چکیده
منابع مشابه
A Method to Translate Order-Sorted Algebras to Many-Sorted Algebras
Order-sorted algebras and many sorted algebras exist in a long history with many different implementations and applications. A lot of language specifications have been defined in order-sorted algebra frameworks such as the language specifications in K (an order-sorted algebra framework). The biggest problem in a lot of the order-sorted algebra frameworks is that even if they might allow develop...
متن کاملSubalgebras of an Order Sorted Algebra. Lattice of Subalgebras1
Let S be an order sorted signature and let U0 be an order sorted algebra of S. A many sorted subset indexed by the sorts of U0 is said to be an OSSubset of U0 if: (Def. 2) It is an order sorted set of S. Let S be an order sorted signature. One can verify that there exists an order sorted algebra of S which is monotone, strict, and non-empty. Let S be an order sorted signature and let U0 be a no...
متن کاملFree Order Sorted Universal Algebra 1 Josef Urban
(1) Let S be an order sorted signature, U0 be a strict non-empty order sorted algebra of S, and A be a subset of U0. Then A is an order sorted generator set of U0 if and only if for every OSSubset O of U0 such that O = OSClA holds OSGenO = U0. Let us consider S, let U0 be a monotone order sorted algebra of S, and let I1 be an order sorted generator set of U0. We say that I1 is osfree if and onl...
متن کاملFree Order Sorted Universal Algebra
In this paper S is an order sorted signature. Let S be an order sorted signature and let U0 be an order sorted algebra of S. A subset of U0 is called an order sorted generator set of U0 if: (Def. 1) For every OSSubset O of U0 such that O = OSCl it holds the sorts of OSGenO = the sorts of U0. The following proposition is true (1) Let S be an order sorted signature, U0 be a strict non-empty order...
متن کاملOrder Sorted Quotient Algebra 1 Josef Urban
Let R be a non empty poset and let A, B be many sorted sets indexed by R. One can check that every many sorted relation between A and B which is os-compatible is also order-sorted. Let R be a non empty poset and let A be a many sorted set indexed by the carrier of R. An order sorted relation of A is an order sorted relation of A, A. Let S be an order sorted signature and let U1 be an order sort...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 4 شماره
صفحات -
تاریخ انتشار 1994